Approaches for backup and restoration of integrated databases

ABSTRACT

Systems and methods are provided for determining a user request to perform a backup of a given application being provided through one or more computing systems, the user request specifying a unique identifier for the backup and an identifier corresponding to the application, determining information for performing the backup of the application based at least in part on the identifier corresponding to the application, the information specifying at least an endpoint to which data associated with the application is to be backed up, and performing a backup of the data associated with the application, wherein the data is backed up at the endpoint.

FIELD OF THE INVENTION

This disclosure relates to approaches for backup and restoration ofdata.

BACKGROUND

Under conventional approaches, backup processes can be initiated to copyvarious data to sites for preservation. These sites may include backupdata stores or backup media. In general, a backup of data may capture apoint-in-time snapshot of the data that can be used to fully restore thedata at a later time. Such backups may be performed on-demand and/or atpre-defined time intervals. Further, such backups of the data may befull backups that copy the data in its entirety or incremental backupsthat copy portions of the data. In some instances, such conventionalapproaches for backing up and restoring data can be inadequateespecially in distributed computing environments that include variousdatabases and disparate data sources.

SUMMARY

Various embodiments of the present disclosure can include systems,methods, and non-transitory computer readable media configured todetermine a user request to perform a backup of a given applicationbeing provided through one or more computing systems, the user requestspecifying a unique identifier for the backup and an identifiercorresponding to the application; determine information for performingthe backup of the application based at least in part on the identifiercorresponding to the application, the information specifying at least anendpoint to which data associated with the application is to be backedup; and perform a backup of the data associated with the application,wherein the data is backed up at the endpoint.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to cause a directory tree to be created inat least one data store to which the backup of the data is to be stored,the data store being associated with the endpoint.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to determine a user request to perform arestoration of the application, the user request specifying the uniqueidentifier for the backup and the identifier corresponding to theapplication; obtain data corresponding to the backup of the dataassociated with the application from the endpoint; and perform arestoration of the backup of the data associated with the application.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to generate one or more hashes using atleast a portion of the data associated with the application, wherein thehashes are generated from one or more key-value pairs in a key-valuestore associated with the application.

In some embodiments, the portion of the data for which the hashes aregenerated is sampled pseudo-randomly and/or deterministically.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to generate one or more hashes using atleast a portion of the data associated with the application, wherein thehashes are generated from data that is sampled pseudo-randomly from oneor more database tables.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to determine at least one database that isassociated with the application; generate a backup of at least one indexcorresponding to the database; and after backup of the index iscomplete, generating a backup of the database.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to generate an incremental re-index forthe database, wherein the incremental re-index is able to be replayed toupdate the index to reference data that was added to the database afterbackup of the index.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to determine at least one database that isassociated with the application; determine at least one key-value storethat is associated with the application; generate a backup of thedatabase; and after backup of the database is complete, generating abackup of the key-value store.

In some embodiments, the systems, methods, and non-transitory computerreadable media are configured to determine that the data associated withthe application is stored among a cluster of nodes; determine topologyinformation that describes an arrangement of the cluster of nodes;generate a backup of the data associated with the application from thecluster of nodes; and store the topology information with the backup ofthe data, wherein the topology information is able to be used to restorethe data to any cluster of nodes that matches the arrangement of thecluster of nodes.

These and other features of the systems, methods, and non-transitorycomputer readable media disclosed herein, as well as the methods ofoperation and functions of the related elements of structure and thecombination of parts and economies of manufacture, will become moreapparent upon consideration of the following description and theappended claims with reference to the accompanying drawings, all ofwhich form a part of this specification, wherein like reference numeralsdesignate corresponding parts in the various figures. It is to beexpressly understood, however, that the drawings are for purposes ofillustration and description only and are not intended as a definitionof the limits of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

Certain features of various embodiments of the present technology areset forth with particularity in the appended claims. A betterunderstanding of the features and advantages of the technology will beobtained by reference to the following detailed description that setsforth illustrative embodiments, in which the principles of the inventionare utilized, and the accompanying drawings of which:

FIG. 1 illustrates an example environment for performing backup andrestoration of data, in accordance with various embodiments.

FIG. 2 illustrates an example backup engine, in accordance with variousembodiments.

FIG. 3 illustrates an example restore engine, in accordance with variousembodiments.

FIG. 4 illustrates a flowchart of an example method, in accordance withvarious embodiments.

FIG. 5 illustrates a flowchart of another example method, in accordancewith various embodiments.

FIG. 6 illustrates a block diagram of an example computer system inwhich any of the embodiments described herein may be implemented.

DETAILED DESCRIPTION

Under conventional approaches, backup processes can be initiated to copyvarious data to sites for preservation. These sites may include backupdata stores or backup media. In general, a backup of data may capture apoint-in-time snapshot of the data that can be used to fully restore thedata at a later time. Such backups may be performed on-demand and/or atpre-defined time intervals. Further, such backups of the data may befull backups that copy the data in its entirety or incremental backupsthat copy portions of the data. In some instances, such conventionalapproaches for backing up and restoring data can be inadequateespecially in distributed computing environments that include variousdatabases and disparate data sources.

A claimed solution rooted in computer technology overcomes problemsspecifically arising in the realm of computer technology. In variousembodiments, a data protection system can be configured to backup dataassociated with one or more applications (or services) that rely onvarious databases and disparate data sources. For example, a user caninitiate a backup of data associated with a given application through atransfer service. The transfer service can be configured to copy thedata associated with the application to an endpoint (e.g., cloudstorage). In some embodiments, the transfer service copies the databased on a specified backup order. The transfer service can create alocal backup of the data on a data store that is accessible to thetransfer service. This backup can then be encrypted and uploaded to theendpoint. When a restoration of the data is initiated by the user, thetransfer service can obtain the data from the endpoint and subsequentlydecrypt the data. The transfer service can then verify the integrity ofthe data, for example, by performing checksum operations on the data. Ifverification is successful, the transfer service can restore the data tothe computing system(s) from which the data was originally backed up. Insome embodiments, the transfer service performs the data restorationbased on a specified restoration order.

FIG. 1 illustrates an example environment 100 for performing backup andrestoration of data, in accordance with various embodiments. The exampleenvironment 100 can include at least one computing system 102 thatincludes one or more processors and memory. The processors can beconfigured to perform various operations by interpretingmachine-readable instructions.

In some embodiments, the computing system 102 can include a dataprotection engine 104 which can include a backup engine 106 and arestore engine 108. The data protection engine 104 can be executed bythe processor(s) of the computing system 102 to perform variousoperations including those described in reference to the backup engine106 and the restore engine 108. In general, the data protection engine104 can be implemented, in whole or in part, as software that is capableof running on one or more computing devices or systems. In one example,the data protection engine 104 may be implemented as or within asoftware application running on one or more computing devices (e.g.,user or client devices) and/or one or more servers (e.g., networkservers or cloud servers). In some instances, various aspects of thedata protection engine 104, the backup engine 106, and/or the restoreengine 108 may be implemented in one or more computing systems and/ordevices. The environment 100 may also include one or more data stores130 that are accessible to the computing system 102. In general, a datastore may be any device in which data can be stored and from which datacan be retrieved. The data stores 130 may be accessible to the computingsystem 102 either directly or over a network 150. The network 150 may beany wired or wireless network through which data can be sent andreceived (e.g., the Internet).

In various embodiments, the backup engine 106 can be configured toinitiate, or perform, backups of various data stored in the data stores130. In general, a backup refers to the copying of data (e.g., files,databases, indexes, key-value stores, object graphs, etc.) from aprimary source (e.g., the data stores 130) to a secondary source (e.g.,a storage endpoint 120). In some embodiments, when backup of data fromthe data sources 130 is initiated, the backup engine 106 copies the datafrom the data sources 130 and stores it at a specified storage endpoint(e.g., the storage endpoint 120). In some instances, the storageendpoint may be accessible over one or more networks (e.g., the network150). Further, the storage endpoint 120 may refer to one or more devicesthrough which data can be stored and retrieved. For example, the storageendpoint 120 may be one or more computing systems to which data can besent for storage and retrieval (e.g., a cloud-based storage system,network storage device, etc.). More details describing the backup engine106 will be provided below in reference to FIG. 2.

In various embodiments, the restore engine 108 can be configured toobtain, or download, backups of various data stored at the storageendpoint 120 for purposes of restoring the data. In general, restoring abackup refers to the copying of data from a secondary source (e.g., thestorage endpoint 120) to a primary source (e.g., the data stores 130)from which the data was originally backed up. In some embodiments, whena restore is initiated, the restore engine 108 obtains the data from thestorage endpoint 120 and restores it in appropriate locations (e.g.,drives, directories, folders, etc.) in the data sources 130. In someinstances, the retrieval of data from the storage endpoint 120 may beperformed over one or more networks (e.g., the network 150). Moredetails describing the restore engine 108 will be provided below inreference to FIG. 3.

FIG. 2 illustrates an example backup engine 202, in accordance withvarious embodiments. The backup engine 202 may be implemented as thebackup engine 106 of FIG. 1. In some embodiments, the backup engine 202includes a transfer service engine 204, a transformation engine 206, averification engine 208, a module backup engine 210, an index backupengine 212, and a cluster backup engine 214.

In various embodiments, the transfer service engine 204 can beconfigured to create backups of various data. For example, the transferservice engine 204 can be configured to copy files from one or moredirectories in one or more data stores to one or more specified storageendpoints. In another example, the transfer service engine 204 can beconfigured to create backups of one or more applications (or services)that rely on various databases and/or disparate data sources. In variousembodiments, a user can initiate a backup of data that is accessible toa computing device through a software application running on thecomputing device. In such embodiments, the backup engine 202 can beimplemented in the software application. In some embodiments, wheninitiating the backup, the user can provide the transfer service engine204 with information that can be used to manage the backup. For example,in some embodiments, the user provides the transfer service engine 204with a unique identifier (ID) referencing the backup job being initiatedand an identifier that references the application (or service) beingbacked up. In some embodiments, for each file being backed up (e.g.,files that are part of the application and/or service being backed up),the transfer service engine 204 keeps track of the identifier thatreferences the application (or service) being backed up, the identifierreferencing the backup in which the file was included, and theidentifier of the volume (or data store) from which the file was backedup. In some embodiments, when creating a backup of an application (orservice) the transfer service engine 204 can be configured to performany operations necessary for disabling, or shutting down, theapplication (or service) so that an accurate and consistent backup canbe created. In some embodiments, the transfer service engine 204 createsonline backups of an application (or service) without disabling orshutting down the application (or service).

In various embodiments, the transfer service engine 204 can use theinformation provided by the user to determine how to create a backup ofthe data. For example, the transfer service engine 204 can use theidentifier that references the application (or service) being backed upto determine information for performing the backup. This information maybe obtained from one or more configuration files, for example. In someembodiments, the transfer service engine 204 uses the application (orservice) identifier to identify one or more directories in one or moredata stores in which the application (or service) is installed (orstored). Based on this information, the transfer service engine 204 canalso use the application (or service) identifier to determine one ormore directories that needed to be copied to create a backup of theapplication (or service) being backed up. Further, the transfer serviceengine 204 can also use the application (or service) identifier todetermine one or more storage endpoints to which the backup will be sentfor storage. In some embodiments, the transfer service engine 204 copiesthe data based on a specified backup order. As an example, a backuporder for a given application (or service) may indicate that a databaseshould be backed up first, followed by a different database, followed bya key-value store, followed by data stored in a cluster of nodes. Insome instances, backing up data (e.g., data sources) in a particularbackup order can be necessary to guarantee the backup's integrity,especially in distributed computing systems. For example, backing updata in a particular order may be needed to achieve consistencyguarantees for data that is reliant on, or linked to, data in a separatesystem.

When a backup is initiated, the transfer service engine 204 can beconfigured to copy the data being backed up (e.g., data associated withan application or service) to one or more specified storage endpoints.In some embodiments, when performing the backup, the transfer serviceengine 204 creates a local backup of the data on a data store that isaccessible to the transfer service engine 204. For example, the transferservice engine 204 can initially create a backup of the data beingbacked up in a data store that is locally accessible to the computingdevice on which the transfer service engine 204 is executing. Thetransfer service engine 204 can also create (or request) a directorytree in the storage endpoint that matches the local directory tree ofthe data being backed up. In some embodiments, the respective names ofone or more directories in the directory tree created at the storageendpoint include both the backup job identifier and the application (orservice) identifier corresponding to the backup being performed. Afterthe local backup is complete (e.g., files have been copied to the localdirectory tree), the transfer service 204 can then copy the files in thelocal backup to the specified storage endpoint(s). These files arecopied to the appropriate directories in the directory tree created atthe storage endpoint.

In some embodiments, copying backup data to a storage endpoint isperformed through a centralized backup system. For example, whenperforming a backup, the transfer service engine 204 can create a localbackup of the data on a data store that is accessible to the transferservice engine 204. In such embodiments, the transfer service engine 204can copy the local backup of the data to the centralized backup systemusing various data transfer tools or protocols (e.g., rsync). In oneexample, the local backup can be copied to a distributed file system(e.g., Network File System) that is accessible to the centralized backupsystem. In this example, the centralized backup system can performoperations to transfer the backup data to appropriate storage endpoints.

In some embodiments, the transformation engine 206 is configured toapply one or more data transformations to the local backup prior tocopying the local backup to the storage endpoint(s). For example, insome embodiments, the transformation engine 206 compresses files in thelocal backup using generally known data compression techniques. In someembodiments, files in the local backup are encrypted prior to beingcopied to the storage endpoint(s). Such encryption may be performedusing generally known encryption techniques including, for example,public-key cryptography techniques.

In some embodiments, when copying files to the storage endpoint(s), theverification engine 208 is configured to generate respective checksums(e.g., MD5 sums) for some, or all, of the files being copied to thestorage endpoint(s). In some embodiments, these checksums serve varioususes such as verifying data, determining which files have been added tothe local directory tree of the data being backed up, determining whichfiles have been deleted from the local directory tree, and/ordetermining which files in the local directory tree have been modified.As a result, the verification engine 208 can be used to facilitateincremental backups in addition to full snapshots.

In some embodiments, the verification engine 208 can be configured togenerate respective hashes for some, or all, of the data being backedup. These hashes can be used to verify (or validate) data after beingrestored. In some embodiments, the verification engine 208 generateshashes for a pseudo-random and/or deterministic sample of the data. Insome embodiments, data sampled pseudo-randomly exhibits statisticalrandomness while being generated by a deterministic causal process. Forexample, the verification engine 208 can pseudo-randomly and/ordeterministically sample a set of files included in a given backup. Inthis example, a respective hash can be generated for each sampled file.In various embodiments, these hashes may be generated using generallyknown techniques. In some embodiments, the verification engine 208pseudo-randomly and/or deterministically samples data from data sources(e.g., databases, key-value stores, object graphs, etc.) being backedup. For example, the verification engine 20 can pseudo-randomly and/ordeterministically sample data from a key-value store being backed up andcan generate respective hashes for the sampled data (e.g., key-valuepairs). In some embodiments, the data is pseudo-randomly and/ordeterministically sampled from one or more tables (e.g., tablescorresponding to the key-value store, database tables, etc.). In someembodiments, the verification engine 208 samples data from a given tableby selecting data from a byte encoded address space corresponding to thetable. For example, the verification engine 208 can use the byte encodedaddress space to sample rows from the table. The verification engine 208can then generate respective hashes for each of the sampled rows. Thisapproach can be used to pseudo-randomly and/or deterministically sampledata from a data source (e.g., key-value store, database, etc.) withouthaving to perform a full table scan. Once generated, these hashes can beused to verify the accuracy of data being restored. In some embodiments,the verification engine 208 generates respective hashes for all of thedata stored in a given data source. For example, the verification engine208 can perform a full table scan for a given table and can generaterespective hashes for each row in the table. These hashes can be used tovalidate the rows after being restored. In some embodiments, theverification engine 208 generates respective hashes for certain fieldsin the rows (e.g., fields corresponding to a given column) of a giventable.

In some instances, the data being backed up may be accessible throughone or more databases. To enable backup of such data, in someembodiments, the module backup engine 210 implements one or more modulesthat are configured to access and extract data from various types ofdatabases for purposes of copying the data to a storage endpoint. Insome embodiments, the module backup engine 210 also utilizes thesemodules to obtain data from the storage endpoint and to restore the databack (e.g., restore data back into the backed up application and/orservice). These modules can be vendor- or database-specific. Forexample, the module backup engine 210 can implement the AutomatedStorage Management (ASM) module that is configured to create backups ofan Oracle™ database. In general, modules can be implemented to createbackups of data stored in any given database (e.g., relationaldatabases), object graph, and/or key-value store (KVS). In someembodiments, when backing up a database (e.g., a relational database)and corresponding key-value store, the module backup engine 210 isconfigured to create a backup of the database first followed by a backupof the key-value store. In some embodiments, the index backup engine 212can be configured to create backups of database indexes. For example,conventional approaches typically store database indexes together withthe databases to which those indexes correspond. Under theseconventional approaches, a backup of such databases generally results inthe database indexes also being included in the backup. However, in someimplementations, database indexes may be stored separately from thedatabases themselves. For example, a database index for a given databasemay be stored in a separate service (or data store) that is external tothe database. To ensure that such databases and indexes are backed upaccurately, in some embodiments, the index backup engine 212 creates abackup of any indexes corresponding to a database before creating abackup of the database itself. In such embodiments, when data from thedatabase is being restored, an incremental re-index (or replay) can beperformed to catch up the indexes to any new data that was added to thedatabase. Alternatively, in some embodiments, indexes are rebuilt fromthe database using a full re-index rather than relying on an incrementalre-index.

In some instances, the backup engine 202 may need to create backups ofdata stored in a cluster of nodes having a given topology. In suchinstances, a successful restoration of the data typically requires thatthe data be restored to a cluster of nodes that have a matchingtopology. For example, data backed up from a cluster of 5 nodes may needto be restored to a cluster that also includes 5 nodes. Thus, in someembodiments, the cluster backup engine 214 can be configured to managetopology information (e.g., arrangement of datacenters, racks, nodes,etc.) associated with backups. This information can be used to ensurethat data is restored to the correct nodes which are clustered accordingto the given topology. For example, in some embodiments, the clusterbackup engine 214 can map the nodes of the backed-up stack to the nodesof the restored-into stack so that nodes that were in the same rack inthe backed-up stack are in the same rack in the restored-into stack, andthat racks that are in the same datacenter in the backed-up stack are inthe same datacenter in the restored-into stack.

Although the examples provided herein describe the transfer serviceengine 204 as being invoked by a user to initiate backups of data, ingeneral, the transfer service engine 204 may be invoked in other ways.For example, in some embodiments, the transfer service engine 204 may beinvoked automatically at scheduled times or intervals. In anotherexample, the transfer service engine 204 may be invoked by, or through,the applications (or services) for which backups are being created.

FIG. 3 illustrates an example restore engine 302, in accordance withvarious embodiments. The restore engine 302 may be implemented as therestore engine 108 of FIG. 1. In some embodiments, the restore engine302 includes a transfer service engine 304, a transformation engine 306,a verification engine 308, a module restore engine 310, an index restoreengine 312, and a cluster restore engine 314.

In various embodiments, the transfer service engine 304 can beconfigured to restore data from previous backups of the data. Forexample, the transfer service engine 304 can be configured to copy filesfrom one or more storage endpoints to one or more correspondingdirectories in one or more local data stores. In another example, thetransfer service engine 304 can be configured to restore data frombackups of one or more applications (or services) that rely on variousdatabases and/or disparate data sources. When copying data from astorage endpoint to directories in local data stores, the transferservice engine 304 can copy the files back to their original locationsin the local data stores using the same file names, directorystructures, and contents as determined when initially backing up thedata.

In various embodiments, a user can initiate a restoration of data to acomputing device through a software application running on the computingdevice. In such embodiments, the restore engine 302 can be implementedin the software application. In some embodiments, when initiating therestore, the user can provide the transfer service engine 304 withinformation that can be used to facilitate the restoration. For example,in some embodiments, the user provides the transfer service engine 304with a unique identifier (ID) that references the backup that is beingrestored and an identifier that references the application (or service)being restored. In various embodiments, the transfer service engine 304can use the information provided by the user to determine how to restorea backup. For example, the transfer service engine 304 can identify thebackup that is referenced by the unique identifier provided by the user.The transfer service engine 304 can then copy data corresponding to thebackup from one or more storage endpoints at which the backup was storedto a local data store. In some embodiments, the transfer service engine304 can use the identifier that references the application (or service)being restored to determine information for performing the restore. Thisinformation may be obtained from one or more configuration files, forexample. For example, in some embodiments, the transfer service engine304 uses the application (or service) identifier to identify one or moredirectories in one or more data stores from which the application (orservice) was originally backed up. The transfer service engine 304 canuse this information to restore the application (or service) toappropriate locations in a local data store. The transfer service engine304 can also use the application (or service) identifier to determineone or more storage endpoints from which the backup will be retrieved.In some embodiments, the transfer service engine 304 restores the databased on a specified restore order. In various embodiments, whenrestoring data corresponding to an application (or service), thetransfer service engine 304 can be configured to perform any operationsnecessary for disabling, or shutting down, the application (or service)so that an accurate and consistent restoration of the data can beperformed.

In some embodiments, the transformation engine 306 is configured toapply one or more data transformations to data that was restored from astorage endpoint. For example, in some embodiments, the transformationengine 306 de-compresses files in the restored backup using generallyknown data compression techniques. In some embodiments, files in therestored backup are de-encrypted after being copied from the storageendpoint(s). Such encryption may be performed using generally knownencryption techniques including, for example, public-key cryptographytechniques.

In some embodiments, when restoring data, the verification engine 308 isconfigured to validate the data being restored. For example, in someembodiments, the verification engine 308 can verify hashes (e.g.,pseudo-randomly sampled hashes, full scan hashes, etc.) that weregenerated for the data being restored. These hashes may have been storedwith a backup of the data at a storage endpoint, for example. To verifya given portion of data (e.g., file, row, table, object, etc.), theverification engine 308 can generate a hash for the restored data. Thishash can then be compared against a hash that was generated for the datawhen the data was initially being backed up. If the hashes match, thenaccuracy of the data being restored is confirmed. Otherwise, the datacan be flagged and/or one or more notifications indicating the hashmismatch can be provided to users.

As mentioned, in some instances, the data being restored may have beenbacked up through one or more databases. To enable restoration of suchdata, in some embodiments, the module restore engine 310 implements oneor more modules that are configured to restore data to various types ofdatabases. In general, these modules can be implemented to restore datastored in any given database (e.g., relational databases), object graph,and/or key-value store (KVS).

In some embodiments, the index restore engine 312 can be configured torestore database indexes. For example, when data from the database isbeing restored, an incremental re-index (or replay) can be performed tocatch up the database indexes to any new data that was stored in thedatabase. In some embodiments, rather than applying an incrementalre-indexing, the indexes are rebuilt from the database in their entiretyusing a full re-index.

In some instances, the restore engine 302 may need to restore data thatwas backed up from a cluster of nodes having a given topology. In suchinstances, a successful restoration of the data typically requires thatthe data be restored to a cluster of nodes that have a matchingtopology. Thus, in some embodiments, the cluster restore engine 314 canbe configured to restore the data based on topology information (e.g.,arrangement of datacenters, racks, nodes, etc.) associated with a backupof the data. This information can be used to ensure that data isrestored to the correct nodes which are clustered according to the giventopology.

FIG. 4 illustrates a flowchart of an example method 400, according tovarious embodiments of the present disclosure. The method 400 may beimplemented in various environments including, for example, theenvironment 100 of FIG. 1. The operations of method 400 presented beloware intended to be illustrative. Depending on the implementation, theexample method 400 may include additional, fewer, or alternative stepsperformed in various orders or in parallel. The example method 400 maybe implemented in various computing systems or devices including one ormore processors.

At block 402, a determination is made of a user request to perform abackup of a given application that is being provided through one or morecomputing systems. The user request can specify a unique identifier forthe backup and an identifier corresponding to the application. At block404, information for performing the backup of the application isdetermined based at least in part on the identifier corresponding to theapplication. The information can specify at least an endpoint to whichdata associated with the application is to be backed up. At block 406, abackup of the data associated with the application is performed. As thebackup progresses, the data being backed up is copied to the endpointfor storage.

FIG. 5 illustrates a flowchart of an example method 500, according tovarious embodiments of the present disclosure. The method 500 may beimplemented in various environments including, for example, theenvironment 100 of FIG. 1. The operations of method 500 presented beloware intended to be illustrative. Depending on the implementation, theexample method 500 may include additional, fewer, or alternative stepsperformed in various orders or in parallel. The example method 500 maybe implemented in various computing systems or devices including one ormore processors.

At block 502, a determination is made of a user request to perform arestore a backup of a given application that is being provided throughone or more computing systems. The user request can specify a uniqueidentifier for the backup and an identifier corresponding to theapplication. At block 504, information for restoring the backup of theapplication is determined based at least in part on the identifiercorresponding to the application. The information can specify at least adirectory tree in a data store to which data associated with theapplication is to be restored. At block 506, a restoration of the dataassociated with the application is performed. As the restore progresses,the data being restored is copied to one or more directories in the datastore referenced by the directory tree.

HARDWARE IMPLEMENTATION

The techniques described herein are implemented by one or morespecial-purpose computing devices. The special-purpose computing devicesmay be hard-wired to perform the techniques, or may include circuitry ordigital electronic devices such as one or more application-specificintegrated circuits (ASICs) or field programmable gate arrays (FPGAs)that are persistently programmed to perform the techniques, or mayinclude one or more hardware processors programmed to perform thetechniques pursuant to program instructions in firmware, memory, otherstorage, or a combination. Such special-purpose computing devices mayalso combine custom hard-wired logic, ASICs, or FPGAs with customprogramming to accomplish the techniques. The special-purpose computingdevices may be desktop computer systems, server computer systems,portable computer systems, handheld devices, networking devices or anyother device or combination of devices that incorporate hard-wiredand/or program logic to implement the techniques.

Computing device(s) are generally controlled and coordinated byoperating system software, such as iOS, Android, Chrome OS, Windows XP,Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix,Linux, SunOS, Solaris, iOS, Blackberry OS, VxWorks, or other compatibleoperating systems. In other embodiments, the computing device may becontrolled by a proprietary operating system. Conventional operatingsystems control and schedule computer processes for execution, performmemory management, provide file system, networking, I/O services, andprovide a user interface functionality, such as a graphical userinterface (“GUI”), among other things.

FIG. 6 is a block diagram that illustrates a computer system 600 uponwhich any of the embodiments described herein may be implemented. Thecomputer system 600 includes a bus 602 or other communication mechanismfor communicating information, one or more hardware processors 604coupled with bus 602 for processing information. Hardware processor(s)604 may be, for example, one or more general purpose microprocessors.

The computer system 600 also includes a main memory 606, such as arandom access memory (RAM), cache and/or other dynamic storage devices,coupled to bus 602 for storing information and instructions to beexecuted by processor 604. Main memory 606 also may be used for storingtemporary variables or other intermediate information during executionof instructions to be executed by processor 604. Such instructions, whenstored in storage media accessible to processor 604, render computersystem 600 into a special-purpose machine that is customized to performthe operations specified in the instructions.

The computer system 600 further includes a read only memory (ROM) 608 orother static storage device coupled to bus 602 for storing staticinformation and instructions for processor 604. A storage device 610,such as a magnetic disk, optical disk, or USB thumb drive (Flash drive),etc., is provided and coupled to bus 602 for storing information andinstructions.

The computer system 600 may be coupled via bus 602 to a display 612,such as a cathode ray tube (CRT) or LCD display (or touch screen), fordisplaying information to a computer user. An input device 614,including alphanumeric and other keys, is coupled to bus 602 forcommunicating information and command selections to processor 604.Another type of user input device is cursor control 616, such as amouse, a trackball, or cursor direction keys for communicating directioninformation and command selections to processor 604 and for controllingcursor movement on display 612. This input device typically has twodegrees of freedom in two axes, a first axis (e.g., x) and a second axis(e.g., y), that allows the device to specify positions in a plane. Insome embodiments, the same direction information and command selectionsas cursor control may be implemented via receiving touches on a touchscreen without a cursor.

The computing system 600 may include a user interface module toimplement a GUI that may be stored in a mass storage device asexecutable software codes that are executed by the computing device(s).This and other modules may include, by way of example, components, suchas software components, object-oriented software components, classcomponents and task components, processes, functions, attributes,procedures, subroutines, segments of program code, drivers, firmware,microcode, circuitry, data, databases, data structures, tables, arrays,and variables.

In general, the word “module,” as used herein, refers to logic embodiedin hardware or firmware, or to a collection of software instructions,possibly having entry and exit points, written in a programminglanguage, such as, for example, Java, C or C++. A software module may becompiled and linked into an executable program, installed in a dynamiclink library, or may be written in an interpreted programming languagesuch as, for example, BASIC, Perl, or Python. It will be appreciatedthat software modules may be callable from other modules or fromthemselves, and/or may be invoked in response to detected events orinterrupts. Software modules configured for execution on computingdevices may be provided on a computer readable medium, such as a compactdisc, digital video disc, flash drive, magnetic disc, or any othertangible medium, or as a digital download (and may be originally storedin a compressed or installable format that requires installation,decompression or decryption prior to execution). Such software code maybe stored, partially or fully, on a memory device of the executingcomputing device, for execution by the computing device. Softwareinstructions may be embedded in firmware, such as an EPROM. It will befurther appreciated that hardware modules may be comprised of connectedlogic units, such as gates and flip-flops, and/or may be comprised ofprogrammable units, such as programmable gate arrays or processors. Themodules or computing device functionality described herein arepreferably implemented as software modules, but may be represented inhardware or firmware. Generally, the modules described herein refer tological modules that may be combined with other modules or divided intosub-modules despite their physical organization or storage.

The computer system 600 may implement the techniques described hereinusing customized hard-wired logic, one or more ASICs or FPGAs, firmwareand/or program logic which in combination with the computer systemcauses or programs computer system 600 to be a special-purpose machine.According to one embodiment, the techniques herein are performed bycomputer system 600 in response to processor(s) 604 executing one ormore sequences of one or more instructions contained in main memory 606.Such instructions may be read into main memory 606 from another storagemedium, such as storage device 610. Execution of the sequences ofinstructions contained in main memory 606 causes processor(s) 604 toperform the process steps described herein. In alternative embodiments,hard-wired circuitry may be used in place of or in combination withsoftware instructions.

The term “non-transitory media,” and similar terms, as used hereinrefers to any media that store data and/or instructions that cause amachine to operate in a specific fashion. Such non-transitory media maycomprise non-volatile media and/or volatile media. Non-volatile mediaincludes, for example, optical or magnetic disks, such as storage device610. Volatile media includes dynamic memory, such as main memory 606.Common forms of non-transitory media include, for example, a floppydisk, a flexible disk, hard disk, solid state drive, magnetic tape, orany other magnetic data storage medium, a CD-ROM, any other optical datastorage medium, any physical medium with patterns of holes, a RAM, aPROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip orcartridge, and networked versions of the same.

Non-transitory media is distinct from but may be used in conjunctionwith transmission media. Transmission media participates in transferringinformation between non-transitory media. For example, transmissionmedia includes coaxial cables, copper wire and fiber optics, includingthe wires that comprise bus 602. Transmission media can also take theform of acoustic or light waves, such as those generated duringradio-wave and infra-red data communications.

Various forms of media may be involved in carrying one or more sequencesof one or more instructions to processor 604 for execution. For example,the instructions may initially be carried on a magnetic disk or solidstate drive of a remote computer. The remote computer can load theinstructions into its dynamic memory and send the instructions over atelephone line using a modem. A modem local to computer system 600 canreceive the data on the telephone line and use an infra-red transmitterto convert the data to an infra-red signal. An infra-red detector canreceive the data carried in the infra-red signal and appropriatecircuitry can place the data on bus 602. Bus 602 carries the data tomain memory 606, from which processor 604 retrieves and executes theinstructions. The instructions received by main memory 606 may retrievesand executes the instructions. The instructions received by main memory606 may optionally be stored on storage device 610 either before orafter execution by processor 604.

The computer system 600 also includes a communication interface 618coupled to bus 602. Communication interface 618 provides a two-way datacommunication coupling to one or more network links that are connectedto one or more local networks. For example, communication interface 618may be an integrated services digital network (ISDN) card, cable modem,satellite modem, or a modem to provide a data communication connectionto a corresponding type of telephone line. As another example,communication interface 618 may be a local area network (LAN) card toprovide a data communication connection to a compatible LAN (or WANcomponent to communicated with a WAN). Wireless links may also beimplemented. In any such implementation, communication interface 618sends and receives electrical, electromagnetic or optical signals thatcarry digital data streams representing various types of information.

A network link typically provides data communication through one or morenetworks to other data devices. For example, a network link may providea connection through local network to a host computer or to dataequipment operated by an Internet Service Provider (ISP). The ISP inturn provides data communication services through the world wide packetdata communication network now commonly referred to as the “Internet”.Local network and Internet both use electrical, electromagnetic oroptical signals that carry digital data streams. The signals through thevarious networks and the signals on network link and throughcommunication interface 618, which carry the digital data to and fromcomputer system 600, are example forms of transmission media.

The computer system 600 can send messages and receive data, includingprogram code, through the network(s), network link and communicationinterface 618. In the Internet example, a server might transmit arequested code for an application program through the Internet, the ISP,the local network and the communication interface 618.

The received code may be executed by processor 604 as it is received,and/or stored in storage device 610, or other non-volatile storage forlater execution.

Each of the processes, methods, and algorithms described in thepreceding sections may be embodied in, and fully or partially automatedby, code modules executed by one or more computer systems or computerprocessors comprising computer hardware. The processes and algorithmsmay be implemented partially or wholly in application-specificcircuitry.

The various features and processes described above may be usedindependently of one another, or may be combined in various ways. Allpossible combinations and sub-combinations are intended to fall withinthe scope of this disclosure. In addition, certain method or processblocks may be omitted in some implementations. The methods and processesdescribed herein are also not limited to any particular sequence, andthe blocks or states relating thereto can be performed in othersequences that are appropriate. For example, described blocks or statesmay be performed in an order other than that specifically disclosed, ormultiple blocks or states may be combined in a single block or state.The example blocks or states may be performed in serial, in parallel, orin some other manner. Blocks or states may be added to or removed fromthe disclosed example embodiments. The example systems and componentsdescribed herein may be configured differently than described. Forexample, elements may be added to, removed from, or rearranged comparedto the disclosed example embodiments.

Conditional language, such as, among others, “can,” “could,” “might,” or“may,” unless specifically stated otherwise, or otherwise understoodwithin the context as used, is generally intended to convey that certainembodiments include, while other embodiments do not include, certainfeatures, elements and/or steps. Thus, such conditional language is notgenerally intended to imply that features, elements and/or steps are inany way required for one or more embodiments or that one or moreembodiments necessarily include logic for deciding, with or without userinput or prompting, whether these features, elements and/or steps areincluded or are to be performed in any particular embodiment.

Any process descriptions, elements, or blocks in the flow diagramsdescribed herein and/or depicted in the attached figures should beunderstood as potentially representing modules, segments, or portions ofcode which include one or more executable instructions for implementingspecific logical functions or steps in the process. Alternateimplementations are included within the scope of the embodimentsdescribed herein in which elements or functions may be deleted, executedout of order from that shown or discussed, including substantiallyconcurrently or in reverse order, depending on the functionalityinvolved, as would be understood by those skilled in the art.

It should be emphasized that many variations and modifications may bemade to the above-described embodiments, the elements of which are to beunderstood as being among other acceptable examples. All suchmodifications and variations are intended to be included herein withinthe scope of this disclosure. The foregoing description details certainembodiments of the invention. It will be appreciated, however, that nomatter how detailed the foregoing appears in text, the invention can bepracticed in many ways. As is also stated above, it should be noted thatthe use of particular terminology when describing certain features oraspects of the invention should not be taken to imply that theterminology is being re-defined herein to be restricted to including anyspecific characteristics of the features or aspects of the inventionwith which that terminology is associated. The scope of the inventionshould therefore be construed in accordance with the appended claims andany equivalents thereof.

Engines, Components, and Logic

Certain embodiments are described herein as including logic or a numberof components, engines, or mechanisms. Engines may constitute eithersoftware engines (e.g., code embodied on a machine-readable medium) orhardware engines. A “hardware engine” is a tangible unit capable ofperforming certain operations and may be configured or arranged in acertain physical manner. In various example embodiments, one or morecomputer systems (e.g., a standalone computer system, a client computersystem, or a server computer system) or one or more hardware engines ofa computer system (e.g., a processor or a group of processors) may beconfigured by software (e.g., an application or application portion) asa hardware engine that operates to perform certain operations asdescribed herein.

In some embodiments, a hardware engine may be implemented mechanically,electronically, or any suitable combination thereof. For example, ahardware engine may include dedicated circuitry or logic that ispermanently configured to perform certain operations. For example, ahardware engine may be a special-purpose processor, such as aField-Programmable Gate Array (FPGA) or an Application SpecificIntegrated Circuit (ASIC). A hardware engine may also includeprogrammable logic or circuitry that is temporarily configured bysoftware to perform certain operations. For example, a hardware enginemay include software executed by a general-purpose processor or otherprogrammable processor. Once configured by such software, hardwareengines become specific machines (or specific components of a machine)uniquely tailored to perform the configured functions and are no longergeneral-purpose processors. It will be appreciated that the decision toimplement a hardware engine mechanically, in dedicated and permanentlyconfigured circuitry, or in temporarily configured circuitry (e.g.,configured by software) may be driven by cost and time considerations.

Accordingly, the phrase “hardware engine” should be understood toencompass a tangible entity, be that an entity that is physicallyconstructed, permanently configured (e.g., hardwired), or temporarilyconfigured (e.g., programmed) to operate in a certain manner or toperform certain operations described herein. As used herein,“hardware-implemented engine” refers to a hardware engine. Consideringembodiments in which hardware engines are temporarily configured (e.g.,programmed), each of the hardware engines need not be configured orinstantiated at any one instance in time. For example, where a hardwareengine comprises a general-purpose processor configured by software tobecome a special-purpose processor, the general-purpose processor may beconfigured as respectively different special-purpose processors (e.g.,comprising different hardware engines) at different times. Softwareaccordingly configures a particular processor or processors, forexample, to constitute a particular hardware engine at one instance oftime and to constitute a different hardware engine at a differentinstance of time.

Hardware engines can provide information to, and receive informationfrom, other hardware engines. Accordingly, the described hardwareengines may be regarded as being communicatively coupled. Where multiplehardware engines exist contemporaneously, communications may be achievedthrough signal transmission (e.g., over appropriate circuits and buses)between or among two or more of the hardware engines. In embodiments inwhich multiple hardware engines are configured or instantiated atdifferent times, communications between such hardware engines may beachieved, for example, through the storage and retrieval of informationin memory structures to which the multiple hardware engines have access.For example, one hardware engine may perform an operation and store theoutput of that operation in a memory device to which it iscommunicatively coupled. A further hardware engine may then, at a latertime, access the memory device to retrieve and process the storedoutput. Hardware engines may also initiate communications with input oroutput devices, and can operate on a resource (e.g., a collection ofinformation).

The various operations of example methods described herein may beperformed, at least partially, by one or more processors that aretemporarily configured (e.g., by software) or permanently configured toperform the relevant operations. Whether temporarily or permanentlyconfigured, such processors may constitute processor-implemented enginesthat operate to perform one or more operations or functions describedherein. As used herein, “processor-implemented engine” refers to ahardware engine implemented using one or more processors.

Similarly, the methods described herein may be at least partiallyprocessor-implemented, with a particular processor or processors beingan example of hardware. For example, at least some of the operations ofa method may be performed by one or more processors orprocessor-implemented engines. Moreover, the one or more processors mayalso operate to support performance of the relevant operations in a“cloud computing” environment or as a “software as a service” (SaaS).For example, at least some of the operations may be performed by a groupof computers (as examples of machines including processors), with theseoperations being accessible via a network (e.g., the Internet) and viaone or more appropriate interfaces (e.g., an Application ProgramInterface (API)).

The performance of certain of the operations may be distributed amongthe processors, not only residing within a single machine, but deployedacross a number of machines. In some example embodiments, the processorsor processor-implemented engines may be located in a single geographiclocation (e.g., within a home environment, an office environment, or aserver farm). In other example embodiments, the processors orprocessor-implemented engines may be distributed across a number ofgeographic locations.

Language

Throughout this specification, plural instances may implementcomponents, operations, or structures described as a single instance.Although individual operations of one or more methods are illustratedand described as separate operations, one or more of the individualoperations may be performed concurrently, and nothing requires that theoperations be performed in the order illustrated. Structures andfunctionality presented as separate components in example configurationsmay be implemented as a combined structure or component. Similarly,structures and functionality presented as a single component may beimplemented as separate components. These and other variations,modifications, additions, and improvements fall within the scope of thesubject matter herein.

Although an overview of the subject matter has been described withreference to specific example embodiments, various modifications andchanges may be made to these embodiments without departing from thebroader scope of embodiments of the present disclosure. Such embodimentsof the subject matter may be referred to herein, individually orcollectively, by the term “invention” merely for convenience and withoutintending to voluntarily limit the scope of this application to anysingle disclosure or concept if more than one is, in fact, disclosed.

The embodiments illustrated herein are described in sufficient detail toenable those skilled in the art to practice the teachings disclosed.Other embodiments may be used and derived therefrom, such thatstructural and logical substitutions and changes may be made withoutdeparting from the scope of this disclosure. The Detailed Description,therefore, is not to be taken in a limiting sense, and the scope ofvarious embodiments is defined only by the appended claims, along withthe full range of equivalents to which such claims are entitled.

It will be appreciated that an “engine,” “system,” “data store,” and/or“database” may comprise software, hardware, firmware, and/or circuitry.In one example, one or more software programs comprising instructionscapable of being executable by a processor may perform one or more ofthe functions of the engines, data stores, databases, or systemsdescribed herein. In another example, circuitry may perform the same orsimilar functions. Alternative embodiments may comprise more, less, orfunctionally equivalent engines, systems, data stores, or databases, andstill be within the scope of present embodiments. For example, thefunctionality of the various systems, engines, data stores, and/ordatabases may be combined or divided differently.

“Open source” software is defined herein to be source code that allowsdistribution as source code as well as compiled form, with awell-publicized and indexed means of obtaining the source, optionallywith a license that allows modifications and derived works.

The data stores described herein may be any suitable structure (e.g., anactive database, a relational database, a self-referential database, atable, a matrix, an array, a flat file, a documented-oriented storagesystem, a non-relational No-SQL system, and the like), and may becloud-based or otherwise.

As used herein, the term “or” may be construed in either an inclusive orexclusive sense. Moreover, plural instances may be provided forresources, operations, or structures described herein as a singleinstance. Additionally, boundaries between various resources,operations, engines, engines, and data stores are somewhat arbitrary,and particular operations are illustrated in a context of specificillustrative configurations. Other allocations of functionality areenvisioned and may fall within a scope of various embodiments of thepresent disclosure. In general, structures and functionality presentedas separate resources in the example configurations may be implementedas a combined structure or resource. Similarly, structures andfunctionality presented as a single resource may be implemented asseparate resources. These and other variations, modifications,additions, and improvements fall within a scope of embodiments of thepresent disclosure as represented by the appended claims. Thespecification and drawings are, accordingly, to be regarded in anillustrative rather than a restrictive sense.

Conditional language, such as, among others, “can,” “could,” “might,” or“may,” unless specifically stated otherwise, or otherwise understoodwithin the context as used, is generally intended to convey that certainembodiments include, while other embodiments do not include, certainfeatures, elements and/or steps. Thus, such conditional language is notgenerally intended to imply that features, elements and/or steps are inany way required for one or more embodiments or that one or moreembodiments necessarily include logic for deciding, with or without userinput or prompting, whether these features, elements and/or steps areincluded or are to be performed in any particular embodiment.

Although the invention has been described in detail for the purpose ofillustration based on what is currently considered to be the mostpractical and preferred implementations, it is to be understood thatsuch detail is solely for that purpose and that the invention is notlimited to the disclosed implementations, but, on the contrary, isintended to cover modifications and equivalent arrangements that arewithin the spirit and scope of the appended claims. For example, it isto be understood that the present invention contemplates that, to theextent possible, one or more features of any embodiment can be combinedwith one or more features of any other embodiment.

The invention claimed is:
 1. A system comprising: one or moreprocessors; and a memory storing instructions that, when executed by theone or more processors, cause the system to perform: determining a userrequest to perform a backup of data associated with an application, theapplication being provided through one or more computing systems, theuser request specifying a unique identifier for the backup and anidentifier corresponding to the application; determining information forperforming the backup of the data associated with the application basedat least in part on the identifier corresponding to the application, theinformation specifying at least an endpoint to which the data associatedwith the application is to be backed up and a backup order associatedwith the application, wherein the backup order is indicative of an orderin which the data associated with the application is to be backed up;performing the backup of the data associated with the application,wherein the data is backed up at the endpoint in the backup order, andwherein performing the backup comprises: determining that the dataassociated with the application is stored among a first cluster of nodescorresponding to a backed-up stack of the data associated with theapplication; determining topology information that describes anarrangement of the first cluster of nodes; generating a backup of thedata associated with the application from the first cluster of nodes;and storing the topology information with the backup of the data,wherein the topology information is able to be used to restore the datato any cluster of nodes that matches the arrangement of the firstcluster of nodes, wherein generating the backup of the data associatedwith the application comprises: determining a database associated withthe application; generating a backup of at least one index correspondingto the database, wherein the at least one index is stored in a separatedata store that is external to the database; and after backup of the atleast one index is complete, generating a backup of the database,wherein the instructions, when executed by the one or more processors,further cause the system to perform: performing a restoration of thebackup of the data associated with the application, wherein performingthe restoration comprises utilizing the topology information to map thefirst cluster of nodes corresponding to the backed-up stack to a secondcluster of nodes of a restored-into stack, and wherein performing therestoration comprises performing a restoration of the database; andduring restoration of the database, determining that data was added tothe database after completion of the backup of the at least one indexand performing an incremental re-index to update the at least one indexto reference the data added to the database after completion of thebackup of the at least one index.
 2. The system of claim 1, wherein theinstructions further cause the system to perform: causing a directorytree to be created in at least one data store to which the backup of thedata is to be stored, the data store being associated with the endpoint.3. The system of claim 1, wherein the instructions further cause thesystem to perform: determining a user request to perform a restorationof the application, the user request specifying the unique identifierfor the backup and the identifier corresponding to the application; andobtaining data corresponding to the backup of the data associated withthe application from the endpoint in order to perform the restoration ofthe backup of the data associated with the application.
 4. The system ofclaim 1, wherein the instructions further cause the system to perform:generating one or more hashes using at least a portion of the dataassociated with the application, wherein the hashes are generated fromone or more key-value pairs in a key-value store associated with theapplication.
 5. The system of claim 4, wherein the portion of the datafor which the hashes are generated is sampled pseudo-randomly anddeterministically.
 6. The system of claim 1, wherein the instructionsfurther cause the system to perform: generating one or more hashes usingat least a portion of the data associated with the application, whereinthe hashes are generated from data that is sampled pseudo-randomly fromone or more database tables.
 7. The system of claim 1, whereinperforming the backup of the data associated with the applicationfurther causes the system to perform: determining at least one key-valuestore that is associated with the application; and after backup of thedatabase is complete, generating a backup of the key-value store.
 8. Thesystem of claim 1, wherein the instructions further cause the system toperform: determining a user request to restore the backup of the dataassociated with the application, the user request to restore the backupspecifying the unique identifier for the backup and the identifiercorresponding to the application; and determining information forrestoring the backup based at least in part on the identifiercorresponding to the application, the information for restoring thebackup specifying at least a directory tree in a data store to which thedata associated with the application is to be restored, wherein the datais restored in one or more directories in the data store referenced bythe directory tree.
 9. The system of claim 1, wherein utilizing thetopology information to map the first cluster of nodes corresponding tothe backed-up stack to a second cluster of nodes of the restored-intostack comprises mapping one or more nodes of the first cluster of nodesthat were in a same rack in the backed-up stack to a corresponding oneor more nodes of the second cluster of nodes that are in a same rack inthe restored-into stack.
 10. The system of claim 9, wherein utilizingthe topology information to map the first cluster of nodes correspondingto the backed-up stack to a second cluster of nodes of the restored-intostack further comprises mapping one or more racks that are in a samedatacenter in the backed-up stack to a corresponding one or more racksin a same datacenter in the restored-into stack.
 11. Acomputer-implemented method, the method comprising: determining a userrequest to perform a backup of data associated with an application, theapplication being provided through one or more computing systems, theuser request specifying a unique identifier for the backup and anidentifier corresponding to the application; determining information forperforming the backup of the data associated with the application basedat least in part on the identifier corresponding to the application, theinformation specifying at least an endpoint to which the data associatedwith the application is to be backed up and a backup order associatedwith the application, wherein the backup order is indicative of an orderin which the data associated with the application is to be backed up;performing the backup of the data associated with the application,wherein the data is backed up at the endpoint in the backup order, andwherein performing the backup comprises: determining that the dataassociated with the application is stored among a first cluster of nodescorresponding to a backed-up stack of the data associated with theapplication; determining topology information that describes anarrangement of the first cluster of nodes; generating a backup of thedata associated with the application from the first cluster of nodes;and storing the topology information with the backup of the data,wherein the topology information is able to be used to restore the datato any cluster of nodes that matches the arrangement of the firstcluster of nodes, wherein generating the backup of the data associatedwith the application comprises: determining a database associated withthe application; generating a backup of at least one index correspondingto the database, wherein the at least one index is stored in a separatedata store that is external to the database; and after backup of the atleast one index is complete, generating a backup of the database,wherein the instructions, when executed by the one or more processors,further cause the system to perform: performing a restoration of thebackup of the data associated with the application, wherein performingthe restoration comprises utilizing the topology information to map thefirst cluster of nodes corresponding to the backed-up stack to a secondcluster of nodes of a restored-into stack, and wherein performing therestoration comprises performing a restoration of the database; andduring restoration of the database, determining that data was added tothe database after completion of the backup of the at least one indexand performing an incremental re-index to update the at least one indexto reference the data added to the database after completion of thebackup of the at least one index.
 12. The computer-implemented method ofclaim 11, the method further comprising: causing a directory tree to becreated in at least one data store to which the backup of the data is tobe stored, the data store being associated with the endpoint.
 13. Thecomputer-implemented method of claim 11, the method further comprising:determining a user request to perform a restoration of the application,the user request specifying the unique identifier for the backup and theidentifier corresponding to the application; and obtaining datacorresponding to the backup of the data associated with the applicationfrom the endpoint in order to perform the restoration of the backup ofthe data associated with the application.
 14. The computer-implementedmethod of claim 11, the method further comprising: generating one ormore hashes using at least a portion of the data associated with theapplication, wherein the hashes are generated from one or more key-valuepairs in a key-value store associated with the application.
 15. Thecomputer-implemented method of claim 14, wherein the portion of the datafor which the hashes are generated is sampled pseudo-randomly anddeterministically.
 16. The computer-implemented method of claim 11, themethod further comprising: generating one or more hashes using at leasta portion of the data associated with the application, wherein thehashes are generated from data that is sampled pseudo-randomly from oneor more database tables.
 17. The computer-implemented method of claim11, wherein performing the backup of the data associated with theapplication further comprises: determining at least one key-value storethat is associated with the application; and after backup of thedatabase is complete, generating a backup of the key-value store.